Enumeration of Cubic Graphs by Inclusion–Exclusion

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumeration of cubic lattice walks by contact class

Self-avoiding walks on a three-dimensional ~3D! simple cubic lattice are often used to model polymers, especially proteins. The Hamiltonian is generally taken to be a function of contacts between sequentially nonadjacent residues. The set of all conformations having a particular set of contacts occupies the same energy level, and one would like to estimate the degeneracy or chain entropy of the...

متن کامل

Asymptotic Enumeration of Labelled Graphs by Genus

We obtain asymptotic formulas for the number of rooted 2-connected and 3connected surface maps on an orientable surface of genus g with respect to vertices and edges simultaneously. We also derive the bivariate version of the large facewidth result for random 3-connected maps. These results are then used to derive asymptotic formulas for the number of labelled k-connected graphs of orientable g...

متن کامل

Total domination in cubic Knodel graphs

A subset D of vertices of a graph G is a dominating set if for each u ∈ V (G) \ D, u is adjacent to somevertex v ∈ D. The domination number, γ(G) ofG, is the minimum cardinality of a dominating set of G. A setD ⊆ V (G) is a total dominating set if for eachu ∈ V (G), u is adjacent to some vertex v ∈ D. Thetotal domination number, γt (G) of G, is theminimum cardinality of a total dominating set o...

متن کامل

Cubic symmetric graphs of orders $36p$ and $36p^{2}$

A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we  classifyall the connected cubic symmetric  graphs of order $36p$  and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.

متن کامل

Enumeration of cubic multigraphs on orientable surfaces

Let Sg be the orientable surface of genus g. We show that the number of edgelabelled cubic multigraphs embeddable on Sg with m = 3k edges is asymptotically dgγ −mm5/2(g−1)−1m!, where γ−1 = √ 79 3 2 −1/3 and cg is a constant only dependent on the genus.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 1999

ISSN: 0097-3165

DOI: 10.1006/jcta.1998.2923